Truthful mechanisms for two-range-values variant of unrelated scheduling
نویسندگان
چکیده
منابع مشابه
An Improved Randomized Truthful Mechanism for Scheduling Unrelated Machines
We study the scheduling problem on unrelated machines in the mechanism design setting. This problem was proposed and studied in the seminal paper of Nisan and Ronen [NR99], where they gave a 1.75-approximation randomized truthful mechanism for the case of two machines. We improve this result by a 1.6737-approximation randomized truthful mechanism. We also generalize our result to a 0.8368m-appr...
متن کاملOn Designing Truthful Mechanisms for Online Scheduling
We study the online version of the scheduling problem Q||Cmax involving selfish agents, considered by Archer and Tardos in [FOCS 2001], where jobs must be scheduled on m related machines, each of them owned by a different selfish agent. We present a general technique for transforming competitive online algorithms for Q||Cmax into truthful online mechanisms with a small loss of competitiveness. ...
متن کاملDeterministic Truthful Approximation Mechanisms for Scheduling Related Machines
We consider the problem of scheduling jobs on parallel related machines owned by selfish agents. We provide deterministic polynomial-time (2 + ǫ)-approximation algorithms and suitable payment functions that yield truthful mechanisms for several NP-hard restrictions of this problem. Up to our knowledge, our result is the first non-trivial polynomial-time deterministic truthful mechanism for this...
متن کاملTruthful Mechanisms for Value-Based Scheduling in Cloud Computing
1 Abbreviations and Notation 2
متن کاملTruthful Mechanisms for Scheduling Selfish Related Machines Using ACO
Task scheduling is a major challenge in parallel and distributed systems. Task scheduling techniques in distributed systems are usually based on trusting the Accuracy of the information about the status of resources. In a commercial multiCloud environment, individual providers are focused towards increasing their own profits and do not care about the utility of users and other providers. In suc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2009
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2009.02.001